Almost Disjointness Preservers
نویسندگان
چکیده
منابع مشابه
Linear disjointness preservers of W*-algebras
In this paper, we give a complete description of the structure of zero product and orthogonality preserving linear maps between W*-algebras. In particular, two W*-algebras are *-isomorphic if and only if there is a bijective linear map between them preserving their zero product or orthogonality structure in two directions. It is also the case when they have equivalent linear and left (right) id...
متن کاملBounding, splitting, and almost disjointness
We investigate some aspects of bounding, splitting, and almost disjointness. In particular, we investigate the relationship between the bounding number, the closed almost disjointness number, splitting number, and the existence of certain kinds of splitting families.
متن کاملSplitting, Bounding, and Almost Disjointness Can Be Quite Different
We prove the consistency of add(N ) < cov(N ) < p = s < add(M) = cof(M) < a = non(N ) = c with ZFC where each of these cardinal invariants assume arbitrary uncountable regular
متن کاملLearning Disjointness
An increasing number of applications benefits from light-weight ontologies, or to put it differently “a little semantics goes a long way”. However, our experience indicates that more expressiveness can offer significant advantages. Introducing disjointness axioms, for instance, greatly facilitates consistency checking and the automatic evaluation of ontologies. In an extensive user study we dis...
متن کاملLinear Size Distance Preservers
The famous shortest path tree lemma states that, for any node s in a graph G = (V,E), there is a subgraph on O(n) edges that preserves all distances between node pairs in the set {s}×V . A very basic question in distance sketching research, with applications to other problems in the field, is to categorize when else graphs admit sparse subgraphs that preserve distances between a set P of p node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2017
ISSN: 0008-414X,1496-4279
DOI: 10.4153/cjm-2016-020-x